package fundamental;

import java.util.ArrayList;
import java.util.HashSet;

public class LSObj {
    // 当前最优总成本
    public double cost = Double.MAX_VALUE;
    public double firCost = 0;
    public double secCost = 0;

    //  存储当前最优的各级车队信息
    public ArrayList<FirstVehicle> firVehicleList = new ArrayList<>();
    public ArrayList<SecondVehicle> secVehicleList = new ArrayList<>();
    public HashSet<Cand> bestOpened = new HashSet<>();
}